Self-avoiding walks, the language of science, and Fibonacci numbers
نویسنده
چکیده
The self-avoiding walk, restricted to a strip, is considered in the context of linguistic combinatorics. AMS class!Jications: 05A15; 05E15; 60J15
منابع مشابه
Self-Avoiding Walks and Fibonacci Numbers
By combinatorial arguments, we prove that the number of self-avoiding walks on the strip {0, 1} × Z is 8Fn − 4 when n is odd and is 8Fn − n when n is even. Also, when backwards moves are prohibited, we derive simple expressions for the number of length n self-avoiding walks on {0, 1} × Z, Z× Z, the triangular lattice, and the cubic lattice.
متن کاملCoefficient Bounds for Analytic bi-Bazileviv{c} Functions Related to Shell-like Curves Connected with Fibonacci Numbers
In this paper, we define and investigate a new class of bi-Bazilevic functions related to shell-like curves connected with Fibonacci numbers. Furthermore, we find estimates of first two coefficients of functions belonging to this class. Also, we give the Fekete-Szegoinequality for this function class.
متن کاملSelf Avoiding Walks, The Language 1 of Science, and Fibonacci Numbers
Doron ZEILBERGER 2 Science is a language. In fact, science is language. This was shown brilliantly by Xavier Vien-not and his Ecole Bordelaise (e.g. [V][DV][B]). Viennot, Maylis Delest, and their disciples code animals and other physical creatures in terms of algebraic (context-free) languages, by using the so-called Schutzenberger methodology (which Marco Schutzenberger prefers to call the DSV...
متن کاملSelf-avoiding walks and polygons on quasiperiodic tilings
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices, these numbers depend on the chosen initial vertex. We compare different ways of counting and demonstrate that suitable averaging improves convergence to the asym...
متن کاملEnergy of Graphs, Matroids and Fibonacci Numbers
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.
متن کامل